Typed Norms for Typed Logic Programs

نویسندگان

  • Jonathan C. Martin
  • Andy King
  • Paul Soper
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Declarative Semantics for Typed Logic Programs

Many typed (sorted) logic programming languages are based on sorted logics in which there is typically a set of well-sortedness rules in addition to the ordinary well-formedness rules. An advantage of this approach is that type checking is typically decidable. However such an approach restricts the expressiveness of typed logic programming language. On the other hand, there is another approach ...

متن کامل

A Transformational Approach to Resource Analysis with Typed-Norms

In order to automatically infer the resource consumption of programs, analyzers track how data sizes change along a program’s execution. Typically, analyzers measure the sizes of data by applying norms which are mappings from data to natural numbers that represent the sizes of the corresponding data. When norms are defined by taking type information into account, they are named typed-norms. The...

متن کامل

Using Modes to Ensure Subject Reduction for Typed Logic Programs with Subtyping

We consider a general prescriptive type system with parametric polymorphism and subtyping for logic programs. The property of subject reduction expresses the consistency of the type system w.r.t. the execution model: if a program is"well-typed", then all derivations starting in a"well-typed"goal are again"well-typed". It is well-established that without subtyping, this property is readily obtai...

متن کامل

Termination Analysis with Types Is More Accurate

In this paper we show how we can use size and groundness analyses lifted to regular and (polymorphic) Hindley/Milner typed programs to determine more accurate termination of (type correct) programs. Type information for programs may be either inferred automatically or declared by the programmer. The analysis of the typed logic programs is able to completely reuse a framework for termination ana...

متن کامل

A Sound and Complete Hoare Logic for Dynamically-Typed, Object-Oriented Programs - Extended Version -

A simple dynamically-typed, (purely) object-oriented language is defined. A structural operational semantics as well as a Hoarestyle program logic for reasoning about programs in the language in multiple notions of correctness are given. The Hoare logic is proved to be both sound and (relative) complete and is – to the best of our knowledge – the first such logic presented for a dynamically-typ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1996